An algorithm of combining of advancing front and delaunay triangulation to 3-D domain tesselation
نویسندگان
چکیده
The paper presents an algorithm of volume meshing by using the Advancing Front Technique (AFT) combined with the Delaunay Triangulation. The tetrahedronization starts with the surface mesh with the elements oriented towards the interior 3-D domain. The main idea is based upon AFT, with simultaneous points insertion and tetrahedra creation. The characteristic feature of the approach is the part of AFT in the case, when a new calculated point on the current face of the front is not accepted then the existing point in the front is found to create a new tetrahedron by using the Delaunay triangulation on the given set of points. Additionally the algorithm takes a mesh size function into account.
منابع مشابه
Adaptive Solution of Steady Two Dimensional Flow on an Unstructured Grid
Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roe's flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, ac...
متن کاملAdaptive Solution of Steady Two Dimensional Flow on an Unstructured Grid
Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roes flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, acc...
متن کاملOn the total correctness of lawson's oriented walk algorithm
Lawson's oriented walk is a simple algorithm for point location without preprocessing. Originally formulated for planar Delaunay triangulations 2], it generalizes immediately to tesselations of a convex, polyhedral domain into convex, polyhedral cells in d-space. Given a query point q, the algorithm works as follows. 1. Pick some cell C of the tesselation. 2. For each facet F of C, determine th...
متن کاملThree-Dimensional Delaunay Mesh Generation Using a Modi ed Advancing Front Approach
We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...
متن کاملThree-Dimensional Delaunay Mesh Generation Using a Modified Advancing Front Approach
We introduce a meshing method which uses an advancing front Delaunay algorithm. The presented Delaunay technique avoids the need for a temporary tetrahedralization of the convex hull and a later following segmentation step which is typical for commonly used methods. The algorithm is suitable for local regridding applications. This is an important issue for element quality improvements and for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Annales UMCS, Informatica
دوره 9 شماره
صفحات -
تاریخ انتشار 2009